adjacent edge

英 [əˈdʒeɪsnt edʒ] 美 [əˈdʒeɪsnt edʒ]

网络  邻接边; 邻边

计算机



双语例句

  1. On Some Adjacent Vertex-distinguishing Edge Total Coloring of Double Graphs
    关于若干倍图的邻点可区别边全染色
  2. Two Upper Bound of the Adjacent Strong Edge Coloring and the Adjacent Vertex Distinguishing Total Coloring of General Mycielski-Graphs
    广义Mycielski图的邻强边色数和邻点可区别全色数的两个上界
  3. The zone immediately beneath the hydrocarbons is referred to as the bottom water, and the zone of the reservoir laterally adjacent to the trap as the edge zone.
    直接位于烃类以下的带称为底水、横向与圈闭相邻的区带称为边缘地带。
  4. By making vertex lists and adjacent edge lists in advance, real-time slicing is realized.
    通过预先为模型建立点表及邻接边表,实现模型的实时切片。
  5. On the Vertex-distinguishing Edge Coloring and Adjacent Strong Edge Coloring of Join-graph and Double Graph of Some Graphs; Associated Book Publishers Ltd.
    若干联图及倍图的(邻)点可区别边染色联合图书出版公司(英)
  6. On the adjacent strong edge chromatic number of k ( r, 2)
    图K(r,2)的邻强边色数(英文)
  7. When T has two vertices of maximum degree which are adjacent, the adjacent strong edge chromatic number of these product graphs are all Δ( T)+ m+ 1. T is tree graph with n ( n ≥ 3) order.
    当T的最大度点相邻时,它们的邻强边色数均为Δ(T)+m+1.其中T为n(n≥3)阶树图。
  8. Co-staining of 4-1BB~+/ CD4~+ and 4-1BB~+/ CD8~+ immunofluorescence in tumor infiltrating T cells was visualized in 13 liver tissues adjacent to tumor edge ( < 1.0 cm) by confocal microscopy.
    激光共聚焦显微镜检测到13例癌旁1cm肝组织中浸润淋巴细胞41BB+/CD4+或CD8+荧光。
  9. A Note of Adjacent Strong Edge Coloring of Complete Graph with Even Order
    偶阶完全图的邻强边染色法注
  10. On the Adjacent Strong Edge Coloring of Monocycle Graph
    单圈图的邻强边染色
  11. Results The major CT findings in the cases were relative bulginess of the intervertebral discs adjacent to the vertebral edge, partial dislocation of the facet joints and the change of the vertebral canal.
    结果椎间盘相对性相反方向膨出相邻椎体边缘,椎间小关节半脱位及下位椎体上缘层面椎管矢状径的改变具有CT表现的特征性,是CT诊断腰椎退变性滑脱症的主要依据。
  12. The strong adjacent edge chromatic number of outerplanar graph
    外平面图的邻强边色数
  13. On the Adjacent Strong Edge Coloring of Joining Graph with Star and Complete Balanced Bipartite Graph
    星和完全等二部图联图的邻强边染色
  14. On Adjacent Vertex-distinguishing Edge Chromatic Number of C_m · F_n
    Cm·Fn的邻点可区别边色数
  15. On the Adjacent Strong Edge Coloring of C_m · P_n
    Cm·Pn图的邻强边色数
  16. The edge coloring problems contain proper edge coloring, adjacent vertex-distinguishing edge coloring, vertex-distinguishing, and so on.
    本文在染色问题上,着重研究图的6类染色问题,即正常的边染色、邻点可区别的边染色、点可区别的边染色、间隔边染色、间隔点的全染色、完美全染色。
  17. In this paper, the concept of generalized simply supported edge and the principle of superposition have been used to solve the boundary problem of rectangular plate with one edge clamped, two adjacent edges free and the remaining edge supported at several points.
    本文利用广义简支边的概念及叠加原理,求得一边固定、其相邻两边为自由边、对边由多个点支承的矩形板弯曲问题的解。
  18. The adjacent strong edge chromatic numbers of monocycle graphs are obtained in this paper.
    本文研究了单圈图的邻强边染色。
  19. In this paper, we obtain the adjacent strong edge chromatic number of complete r-partite Graph ( r ≥ 2) having two vertices on each partition.
    本文给出了每部有2个点的完全r-部图(r≥2)的邻强边色数。
  20. In this paper, the hybrid genetic algorithm for the adjacent strong edge coloring of graphs is presented.
    提出了图的邻强迫着色问题的混合遗传算法。
  21. TD-SCDMA system adopts spreading codes with 16 chips. When the users of adjacent cell lie in the edge of cell, the interference is severe.
    时分-同步码分多址(TD-SCDMA)系统采用的扩频码码长最大为16,当邻小区用户处于2小区边缘时会对本小区造成较大的干扰。
  22. The anterior and posterior relative bulge of the disk that is adjacent to inferior edge of the olisthy vertebra are considered the main clue and basis of CT diagnosis of lumber spondylolisthesis.
    认为滑椎下方相邻间盘的相对性前、后膨出是CT诊断腰椎滑脱的主要线索或依据。
  23. The minimum number required for an adjacent-strong edge coloring of G is called the adjacent strong edge chromatic number.
    对一个图G进行邻强边染色所需要的最少的颜色数称为是G的邻强边色数。
  24. An Upper Bound of Adjacent Strong Edge Chromatic Number
    一类图的邻强边色数的上界
  25. The adjacent vertex-distinguishing edge chromatic number of join graph of wheel Wm and wheel Wn is obtained in this paper, where Wm, Wn denote wheels with order m+ 1 and wheels with order n+ 1, respectively.
    得到了Wm∨Wn的邻点可区别边色数,其中Wm与Wn分别表示m+1阶和n+1阶的轮,Wm∨Wn表示Wm和Wn的联图。
  26. Adjacent strong edge chromatic number.
    相邻强边着色数。
  27. On the adjacent strong edge coloring of several class of complete 4-partite graphs
    几类完全4-部图的邻强边染色
  28. Adjacent Strong Edge Chromatic Number of Some Corona Graphs
    几类冠图的邻强边色数
  29. The adjacent strong edge chromatic number of several class of complete 4-partite graphs are obtained.
    得到了几类完全4-部图的邻强边色数。
  30. The algorithm for the adjacent strong edge coloring of graphs is an NP-complete problem.
    图的邻强边着色算法是一个NP完全问题。